Valid inequalities for a time-indexed formulation
نویسندگان
چکیده
We present a general time-indexed formulation that contains scheduling problems with unrelated parallel machines. We derive a class of basic valid inequalities for this formulation, and we show that a subset of these inequalities are facet-defining. We characterize all facet-defining inequalities with right-hand side 1. Further, we show how to efficiently separate these inequalities.
منابع مشابه
A big bucket time indexed formulation for nonpreemptive single machine scheduling problems
A big bucket time indexed mixed integer linear programming formulation for nonpreemptive single machine scheduling problems is presented in which the length of each period can be as large as the processing time of the shortest job. The model generalises the classical time indexed model to one in which at most two jobs can be processing in each period. The two models are equivalent in the case t...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملValid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem
The problem of sequencing and scheduling airplanes landing and taking off on a runway is under consideration. We propose a new family of valid inequalities which are obtained from the study of the single machine scheduling problem polytope.
متن کاملProjection results for vehicle routing
A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called twoand three-index formulations, the set partitioning formulation, and various formulations based on extra variables representing the flow of one or more commodities. Until now, there has not been a systematic study of how these formulations relate to each other. An exce...
متن کاملA Polyhedral Study of the Integrated Minimum-Up/-Down Time and Ramping Polytope∗
In this paper, we consider the polyhedral structure of the integrated minimum-up/-downtime and ramping polytope, which has broad applications in power generation scheduling prob-lems. The generalized polytope we studied includes minimum-up/-down time, generation ramp-up/-down rate, logical, and generation upper/lower bound constraints. We derive strong validinequalities for this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 43 شماره
صفحات -
تاریخ انتشار 2015